Connected component

Results: 187



#Item
51Graph / Neighbourhood / Connected component / Adjacency list / Vertex / Adjacency matrix / Process graph / Graph coloring / Edge coloring / Graph theory / Mathematics / NP-complete problems

FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs Da Zheng, Disa Mhembere, Randal Burns, Joshua Vogelstein, Carey E. Priebe, and Alexander S. Szalay, Johns Hopkins University https://www.usenix.org

Add to Reading List

Source URL: www.usenix.org

Language: English - Date: 2015-06-08 13:16:40
52Theoretical computer science / Applied mathematics / Mathematics / Robot / Mobile robot / Topology / ROS / Connected component / Strongly connected component / Graph connectivity / Robotics / Motion planning

The Feasible Transition Graph: Encoding Topology and Manipulation Constraints for Multirobot Push-Planning Laura Lindzey1 , Ross A. Knepper2 , Howie Choset1 , and Siddhartha S. Srinivasa1 1 2

Add to Reading List

Source URL: www.ri.cmu.edu

Language: English - Date: 2014-07-22 11:29:42
53NP-complete problems / Graph coloring / Tree / Clique / Maximal independent set / Graph / Connectivity / Connected component / Independent set / Graph theory / Mathematics / Theoretical computer science

PDF Document

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-04-17 12:02:13
54Connected component / Longest path problem / Tree / Graph / Topological sorting / Vertex / Connectivity / Edge contraction / Aperiodic graph / Graph theory / Depth-first search / Directed acyclic graph

Algorithms Lecture 19: Depth-First Search [Fa’14] Ts’ui Pe must have said once: I am withdrawing to write a book. And another time: I am withdrawing to construct a labyrinth.

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:02:54
55Applied mathematics / Graph theory / Reachability / Directed acyclic graph / Connected component / SL / Graph / Graph connectivity / Theoretical computer science / Mathematics

Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets Houtan Shirani-Mehr Computer Science Dept. Univ. of Southern California

Add to Reading List

Source URL: infolab.usc.edu

Language: English - Date: 2012-05-08 17:15:55
56Network theory / Graph connectivity / Shortest path problem / Graph / Degree / Matching / Maximum flow problem / Connected component / Tree / Graph theory / Mathematics / Theoretical computer science

Finding Shortest Non-Trivial Cycles ∗ in Directed Graphs on Surfaces Sergio Cabello Éric Colin de Verdière

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2010-04-01 04:31:48
57Graph / Connected component / Vertex / Connectivity / Graph coloring / Planar separator theorem / Heawood graph / Graph theory / NP-complete problems / Line graph

Managing Large Graphs on Multi-Cores With Graph Awareness Vijayan Prabhakaran, Ming Wu, Xuetian Weng Frank McSherry, Lidong Zhou, Maya Haridasan†∗∗ Microsoft Research, †Google Abstract

Add to Reading List

Source URL: www.usenix.org

Language: English - Date: 2015-05-31 08:44:11
58Complexity classes / Graph connectivity / Reachability / Connected component / Transitive closure / SL / FO / Configuration graph / Connectivity / Theoretical computer science / Graph theory / Mathematics

Subcubic Algorithms for Recursive State Machines Swarat Chaudhuri Pennsylvania State University University Park, PA 16802, USA

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2008-03-07 16:10:53
59NP-complete problems / Combinatorial optimization / Spanning tree / Matching / Vertex cover / Graph coloring / Minimum spanning tree / Minimum cut / Connected component / Theoretical computer science / Graph theory / Mathematics

Filtering: A Method for Solving Graph Problems in MapReduce Silvio Lattanzi∗ Benjamin Moseley†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-04-18 22:39:50
60Search algorithms / Routing algorithms / Network theory / Shortest path problem / Breadth-first search / Distance / Connected component / Graph / Algorithm / Mathematics / Graph theory / Theoretical computer science

Computing the Shortest Path: A∗ Search Meets Graph Theory Andrew V. Goldberg∗ Abstract We propose shortest path algorithms that use A∗ search in combination with a new graph-theoretic lower-bounding technique based

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2011-10-12 13:22:52
UPDATE